First-Order Logic for the Analysis of Programs on Weak Memory Models Alexei Lisitsa Department of Computer Science University of Liverpool, Liverpool, UK

Source URL: www.ai4fm.org

• Model checking
• First-order logic
• Mathematical logic
• Logic in computer science
• Formal methods
• Theory of computation

A Fast Linear-Arithmetic Solver for DPLL(T) Bruno Dutertre and Leonardo de Moura Computer Science Laboratory, SRI International, 333 Ravenswood Avenue, Menlo Park, CA 94025, USA {bruno, demoura}@csl.sri.com

Source URL: yices.csl.sri.com

• Theoretical computer science
• Logic
• Mathematics
• Constraint programming
• Electronic design automation
• Formal methods
• Logic in computer science
• NP-complete problems
• Satisfiability modulo theories
• Boolean satisfiability problem
• Simplex algorithm
• Satisfiability

Secure Protocols for Secrecy Hanane Houmani and Mohamed Mejri LSFM Research Group Computer Science Department LAVAL University Quebec, Canada

Source URL: www.qatar.cmu.edu

• Cryptography
• Theoretical computer science
• E-commerce
• Secure communication
• Model checking
• Cryptographic protocol
• Public-key cryptography
• Communications protocol
• Formal methods
• Computer security
• Secure multi-party computation

Best-First Rippling Moa Johansson, Alan Bundy and Lucas Dixon 1 School of Informatics

Source URL: homepages.inf.ed.ac.uk

• Automated theorem proving
• Mathematics
• Theoretical computer science
• Search algorithms
• Heuristics
• Rippling
• Logic
• IsaPlanner
• Formal languages
• Logic in computer science
• A* search algorithm
• Mathematical proof

Meta-Logical Frameworks and Formal Digital Libraries ? Carsten Sch¨ urmann Department of Computer Science

Source URL: vstte.ethz.ch

Verification of a Cryptographic Primitive: SHA-256 ANDREW W. APPEL, Princeton University A full formal machine-checked verification of a C program: the OpenSSL implementation of SHA-256. This is an interactive proof of f

Source URL: www.cs.princeton.edu

• Software engineering
• Programming language theory
• Theoretical computer science
• C++
• Logic in computer science
• Proof assistants
• Data types
• SHA-2
• Formal verification
• Separation logic
• Coq
• Functional programming

From Application Models to Filmstrip Models: An Approach to Automatic Validation of Model Dynamics M. Gogolla1 , L. Hamann1 , F. Hilken1∗, M. Kuhlmann1 , R. France2 1 {gogolla,lhamann,fhilken,mk}@informatik.uni-bremen

Source URL: www.db.informatik.uni-bremen.de

• Software engineering
• Theoretical computer science
• Unified Modeling Language
• Computing
• Formal methods
• Object Constraint Language
• ECO
• Postcondition
• Object diagram
• Object Process Methodology
• Class diagram
• Invariant

Template-based circuit understanding Adri`a Gasc´on∗ , Pramod Subramanyan† , Bruno Dutertre∗ , Ashish Tiwari∗ Dejan Jovanovi´c∗ , Sharad Malik† ∗ SRI International , ,

Source URL: yices.csl.sri.com

• Computational complexity theory
• Theoretical computer science
• Theory of computation
• Logic in computer science
• Formal methods
• Boolean algebra
• Complexity classes
• Electronic design automation
• Satisfiability modulo theories
• True quantified Boolean formula
• FO
• NC

Translation Validation for a Verified OS Kernel Thomas Sewell Magnus Myreen Gerwin Klein

Source URL: www.cl.cam.ac.uk

• Software engineering
• Theoretical computer science
• Computing
• Logic in computer science
• Subroutines
• Formal methods
• Formal verification
• Decompiler
• Calling convention
• Isabelle
• Separation logic
• Satisfiability modulo theories